the theory is amenable to proof

См. также в других словарях:

• Theory of conjoint measurement — The theory of conjoint measurement (also known as conjoint measurement or additive conjoint measurement) is a general, formal theory of continuous quantity. It was independently discovered by the French economist Gerard Debreu (1960) and by the… …   Wikipedia

• Amenable group — In mathematics, an amenable group is a locally compact topological group G carrying a kind of averaging operation on bounded functions that is invariant under left (or right) translation by group elements. The original definition, in terms of a… …   Wikipedia

• The Renaissance —     The Renaissance     † Catholic Encyclopedia ► The Renaissance     The Renaissance may be considered in a general or a particular sense, as     (1) the achievements of what is termed the modern spirit in opposition to the spirit which… …   Catholic encyclopedia

• CREATION AND COSMOGONY IN THE BIBLE — The Hebrew Bible commences with a majestic cosmological account of the genesis of the universe. According to Genesis 1:1–2:4a (the P account according to the documentary hypothesis), God created the world in six days and rested on the seventh day …   Encyclopedia of Judaism

• Copyright law of the United States — The copyright law of the United States governs the legally enforceable rights of creative and artistic works under the laws of the United States. Copyright law in the United States is part of federal law, and is authorized by the U.S.… …   Wikipedia

• Representation theory — This article is about the theory of representations of algebraic structures by linear transformations and matrices. For the more general notion of representations throughout mathematics, see representation (mathematics). Representation theory is… …   Wikipedia

• Computational complexity theory — is a branch of the theory of computation in theoretical computer science and mathematics that focuses on classifying computational problems according to their inherent difficulty, and relating those classes to each other. In this context, a… …   Wikipedia

• Modular representation theory — is a branch of mathematics, and that part of representation theory that studies linear representations of finite group G over a field K of positive characteristic. As well as having applications to group theory, modular representations arise… …   Wikipedia

• automata theory — Body of physical and logical principles underlying the operation of any electromechanical device (an automaton) that converts information input in one form into another, or into some action, according to an algorithm. Norbert Wiener and Alan M.… …   Universalium

• Kripke–Platek set theory — The Kripke–Platek axioms of set theory (KP) (IPAEng|ˈkrɪpki ˈplɑːtɛk) are a system of axioms of axiomatic set theory, developed by Saul Kripke and Richard Platek. The axiom system is written in first order logic; it has an infinite number of… …   Wikipedia

• Info-gap decision theory — is a non probabilistic decision theory that seeks to optimize robustness to failure – or opportuneness for windfall – under severe uncertainty,[1][2] in particular applying sensitivity analysis of the stability radius type[3] to perturbations in… …   Wikipedia